Resolution of the burrows-wheeler transform conjecture
نویسندگان
چکیده
research-article Open Access Share on Resolution of the burrows-wheeler transform conjecture Authors: Dominik Kempa Johns Hopkins University, Baltimore, MD MDView Profile , Tomasz Kociumaka University California, Berkeley, CA CAView Authors Info & Claims Communications ACMVolume 65Issue 6June 2022 pp 91–98https://doi.org/10.1145/3531445Online:20 May 2022Publication History 0citation5,249DownloadsMetricsTotal Citations0Total Downloads5,249Last 12 Months5,249Last 6 weeks978 Get Citation AlertsNew Alert added!This alert has been successfully added and will be sent to:You notified whenever a record that you have chosen cited.To manage your preferences, click button below.Manage my Alerts New Alert!Please log in to account Save BinderSave BinderCreate BinderNameCancelCreateExport CitationPublisher SiteView all FormatsPDF
منابع مشابه
Dynamic Burrows-Wheeler Transform
The Burrows-Wheeler Transform is a building block for many text compression applications and self-index data structures. It reorders the letters of a text T to obtain a new text bwt(T ) which can be better compressed. This forward transform has been intensively studied over the years, but a major problem still remains: bwt(T ) has to be entirely recomputed whenever T is modified. In this articl...
متن کاملAttacking Scrambled Burrows-Wheeler Transform
Scrambled Burrows-Wheeler transform [6] is an attempt to combine privacy (encryption) and data compression. We show that the proposed approach is insecure. We present chosen plaintext and known plaintext attacks and estimate their complexity in various scenarios.
متن کاملSyllable-Based Burrows-Wheeler Transform
The Burrows-Wheeler Transform (BWT) is a compression method which reorders an input string into the form, which is preferable to another compression. Usually Move-To-Front transform and then Huffman coding is used to the permutated string. The original method [3] from 1994 was designed for an alphabet compression. In 2001, versions working with word and n-grams alphabet were presented. The newe...
متن کاملFUNCTIONAL PEARLS Inverting the Burrows-Wheeler Transform
Our aim in this pearl is to exploit simple equational reasoning to derive the inverse of the Burrows-Wheeler transform from its specification. We also outline how to derive the inverse of two more general versions of the transform, one proposed by Schindler and the other by Chapin and Tate.
متن کاملThe Burrows-Wheeler Transform: Theory and Practice
In this paper we describe the Burrows-Wheeler Transform (BWT) a completely new approach to data compression which is the basis of some of the best compressors available today. Although it is easy to intuitively understand why the BWT helps compression, the analysis of BWT-based algorithms requires a careful study of every single algorithmic component. We describe two algorithms which use the BW...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications of The ACM
سال: 2022
ISSN: ['1557-7317', '0001-0782']
DOI: https://doi.org/10.1145/3531445